Hybrid Tableaux for the Difference Modality

نویسندگان

  • Mark Kaminski
  • Gert Smolka
چکیده

We present the first tableau-based decision procedure for basic hybrid logic with the difference modality. The decision procedure is gracefully degrading in that the less expressive constructs don’t pay for the computationally expensive difference modality. The procedure can be specialized to reflexive and transitive frames. Key features of our approach are nominal elimination, pattern-based blocking, and expansion control.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse

We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic multi-modal logic extended with nominals, the satisfaction operator, converse, global and difference modalities. All of the constructs are handled natively. To obtain termination, we extend chain-based blocking for logics with c...

متن کامل

Terminating Tableau Systems for Modal Logic with Equality

The paper presents two terminating tableau systems for hybrid logic with the difference modality. Both systems are based on an abstract treatment of equality. They expand formulas with respect to a congruence closure that is not represented explicitly. The first system employs pattern-based blocking. The second system employs chain-based blocking and covers converse modalities. Both systems can...

متن کامل

Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference

We introduce the method of clausal graph tableaux at the example of hybrid logic with difference and star modalities. Clausal graph tableaux are prefix-free and terminate by construction. They provide an abstract method of establishing the small model property of modal logics. In contrast to the filtration method, clausal graph tableaux result in goal-directed decision procedures. Until now no ...

متن کامل

Terminating Tableau Systems for Hybrid Logic with Difference and Converse

This paper contributes to the principled construction of terminating tableau systems for modal logic with nominals and difference modalities [4, 1, 8, 11]. We also consider global and converse modalities and reflexive and transitive relations. Nominals and difference enrich modal logic with equational constraints, and handling these constraints in a terminating tableau system is the main challe...

متن کامل

Terminating Tableau Calculi for Hybrid Logics Extending K

This article builds on work by Bolander and Blackburn [7] on terminating tableau systems for the minimal hybrid logic K. We provide (for the basic uni-modal hybrid language) terminating tableau systems for a number of non-transitive hybrid logics extending K, such as the logic of irreflexive frames, antisymmetric frames, and so on; these systems don’t employ loop-checks. We also provide (for hy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 231  شماره 

صفحات  -

تاریخ انتشار 2009